heap sort meaning in Hindi

Examples

1. Other examples of adaptive sorting algorithms are adaptive heap sort, adaptive merge sort, patience sort, smoothsort, splaysort and Timsort.
2. However, many other partial sorts also reduce to this algorithm for the case " k " = 1, such as a partial heap sort.
3. Thus more sophisticated algorithms are often employed, such as Timsort ( based on merge sort ) or introsort ( based on quicksort, falling back to heap sort ).
4. This operation can be done in O ( n \ cdot \ log _ 2 n ) time, using for example merge sort, heap sort, or quick sort algorithms.
5. Introsort begins with a quicksort, but switches to a heap sort if quicksort is not progressing well; analogously introselect begins with quickselect, but switches to median of medians if quickselect is not progressing well.
6. Merge sorts are also practical for physical objects, particularly as two hands can be used, one for each list to merge, while other algorithms, such as heap sort or quick sort, are poorly suited for human use.
7. If a more sophisticated data structure ( e . g ., heap or binary tree ) is used, the time required for searching and insertion can be reduced significantly; this is the essence of heap sort and binary tree sort.
8. The GNU Standard C + + library, for example, uses a 3-part hybrid sorting algorithm : introsort is performed first ( introsort itself being a hybrid of quicksort and heap sort ), to a maximum depth given by 2 & times; log 2 " n ", where " n " is the number of elements, followed by an insertion sort on the result.
9. Note that the most worst-case sorting algorithms that do optimally well in the worst-case, notably heap sort and merge sort, do not take existing order within their input into account, although this deficiency is easily rectified in the case of merge sort by checking if left . last _ item d " right . first _ item, in which case a merge operation may be replaced by simple concatenation  a modification that is well within the scope of making an algorithm adaptive.